LP, Graphs and Formulations
Special case of minimum cost flow
If there is enough capacity on the edges and the distance is a cost, the cost of one flow and the distance in the shortest path in the original graph match.
Least Cost Circular Flow] problem with minimum flow constraint
Potential difference maximization problem under difference constraints
---
This page is auto-translated from /nishio/LPとグラフと定式化. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.